Efficient Computation of Visibility Polygons
نویسندگان
چکیده
Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations, and corresponding experimental evaluations, for two established and one novel algorithm for computing visibility polygons. These algorithms will be released to the public shortly, as a new package for the Computational Geometry Algorithms Library (CGAL).
منابع مشابه
Query point visibility computation in polygons with holes
In this paper, we consider the problem of computing the visibility of a query point inside polygons with holes. The goal is to perform this computation efficiently per query considering the cost of the preprocessing phase. Our algorithm is based on solutions in [A.L.P. Bose, J.I. Munro, Efficient visibility queries in simple polygons, Computational Geometry: Theory and Applications 23 (3) (2002...
متن کاملBSP Visibility on S
Despite over four decades of published algorithms for the computation of visibility, a large gap between theory and practice remains. A significant objective is to design and implement a robust and efficient algorithm that makes it possible to generate the set of polygons visible from an observer in a piecewise linear scene. We describe here and in the accompanying manuscript an algorithm that ...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملA Spatially and Temporally Coherent Visibility Algorithm a Spatially and Temporally Coherent Object Space Visibility Algorithm
EEciently identifying polygons that are visible from a changing synthetic viewpoint is an important problem in computer graphics. In many complex geometric models, most parts of the model are invisible from the instantaneous viewpoint. Despite this, hidden-surface algorithms like the z-buuer or BSP tree often expend signiicant computation resources processing invisible portions of the model. In...
متن کاملA Spatially and Temporally Coherent Object Space Visibility Algorithm
E ciently identifying polygons that are visible from a changing synthetic viewpoint is an important problem in computer graphics. In many complex geometric models, most parts of the model are invisible from the instantaneous viewpoint. Despite this, hidden-surface algorithms like the zbu er or BSP tree often expend signi cant computation resources processing invisible portions of the model. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1403.3905 شماره
صفحات -
تاریخ انتشار 2014